In mathematics, duality theory for distributive lattices provides three different (but closely related) representations of bounded distributive lattices via Priestley spaces, spectral spaces, and pairwise Stone spaces. This generalizes the well-known Stone duality between Stone spaces and Boolean algebras.
Let L be a bounded distributive lattice, and let X denote the set of prime filters of L. For each a ∈ L, let φ+(a) = {x∈ X : a ∈ x} . Then (X,τ+) is a spectral space,[1] where the topology τ+ on X is generated by {φ+(a) : a∈ L} . The spectral space (X,τ+) is called the prime spectrum of L.
The map φ+ is a lattice isomorphism from L onto the lattice of all compact open subsets of (X,τ+). In fact, each spectral space is homeomorphic to the prime spectrum of some bounded distributive lattice.[2]
Similarly, if φ−(a) = {x∈ X : a ∉ x} and τ− denotes the topology generated by {φ−(a) : a∈ L}, then (X,τ−) is also a spectral space. Moreover, (X,τ+,τ−) is a pairwise Stone space. The pairwise Stone space (X,τ+,τ−) is called the bitopological dual of L. Each pairwise Stone space is bi-homeomorphic to the bitopological dual of some bounded distributive lattice.[3]
Finally, let ≤ be set-theoretic inclusion on the set of prime filters of L and let τ = τ+∨ τ−. Then (X,τ,≤) is a Priestley space. Moreover, φ+ is a lattice isomorphism from L onto the lattice of all clopen up-sets of (X,τ,≤). The Priestley space (X,τ,≤) is called the Priestley dual of L. Each Priestley space is isomorphic to the Priestley dual of some bounded distributive lattice.[4]
Let Dist denote the category of bounded distributive lattices and bounded lattice homomorphisms. Then the above three representations of bounded distributive lattices can be extended to dual equivalence[5] between Dist and the categories Spec, PStone, and Pries of spectral spaces with spectral maps, of pairwise Stone spaces with bi-continuous maps, and of Priestley spaces with Priestley morphisms, respectively:
Thus, there are three equivalent ways of representing bounded distributive lattices. Each one has its own motivation and advantages, but ultimately they all serve the same purpose of providing better understanding of bounded distributive lattices.